3 … 2 … 1 … 0?

2 3 1 1 1 0 0 0 0 1 1 1 2 3 1 2 3 1 3 2 2 3 Adjacency matrix Adjacency list

Graphs and Digraphs: A graph G = (V,E) is a structure that represents a discrete set V objects, called vertices or nodes, and a set of pairwise relations E between these objects, called edges. Edges may be directed from one vertex to another or may be undirected. The term “graph” means an undirected graph, and directed graphs are often called digraphs (see Fig. 1). Graphs and digraphs provide a...

!"#$% &'(!%)*+&%+,-)./0%*$/!1+&%+2*%.'3,%

F 0 1 2 3 2 N ? 2 2 N ? 1 0 0 0 0 0 0 0 1 1 2 2 2 2 2

13 Proof: R private (f) C private (f) since in any protocol the parties send at least one bit per round. On the other hand, for every privately computable function f the bound R private (f) is achieved by the protocol A f. In any round of this protocol the parties send a message with size at most n. (Note that in steps (2a) and (2b) of A f we may save one bit per round by omitting the most sign...

3 2 1 0 4 3 2

89!$ 7*+ ,!-." /0 1!2!-3 456 )("&'% !"#$1&AB&9!C&C @($&?+ 7 (:

=> L!"M,0 ) -,N#>< $!"O( !> %C>2DE .: 0 3JF 6 7# KH#2 . 6#! "I >3,H9 3(G3H0! %,X 53( W )> A! :&C .6 #! $1"V 5%N9K @ST .=< UJ 53( :P12Q< A! :&C G!2NRK9 A! :8&C 68,3+< :H8V)>%,( . 68#! =YF W)> A! $13XM#! .=< A! %C>2DE ZY[ 5!"9 G!"4'()*+ KF2 1>2 ",`! 53( ^3# >1 G< :9YF _!2` ) $129 $1A39 "+ 53( =]3F 389 ) :928#>U ( W)> K9 6,3+< : HV)>%,( L!>]2030 B()*+ bC! >1 .6 #! KME"P >!"a ) c38! 53...